Dynamic Data Distribution and Processor Repartitioning for Irregularly Structured Computations
نویسندگان
چکیده
Irregular applications comprise a significant and increasing portion of jobs running in parallel environments. Recent research has shown that, in parallel environments, both the system utilization and application turn around time improve when resources allocated to applications can be dynamically adjusted at run-time, depending on the workload. To realize this, at least some of the parallel applications in the system need to be dynamically reconfigurable. We have implemented the Distributed Resource Management System (DRMS) that supports the development and execution of regular and irregular reconfigurable applications in time-variant resource environments. In this paper, we discuss DRMS support for developing reconfigurable irregular applications and describe the dynamic data redistribution mechanisms in some detail. We also present performance levels achieved by the data redistribution primitives, using a sparse Cholesky factorization algorithms as a model irregular application. Our results show that the cost of dynamic data redistribution among different processor configurations for irregular data are comparable to those for regular data. © 1998 Academic Press
منابع مشابه
Hypergraph-based Dynamic Partitioning and Load Balancing
1.1 INTRODUCTION An important component of parallel scientific computing is the assignment of work to processors. This assignment problem is also known as partitioning or mapping. The goal of the assignment problem is to find a task-to-processor mapping that will minimize the total execution time. Although efficient optimal solutions for certain restricted variations, such as chain-or tree-stru...
متن کاملParallel Soil–Foundation–Structure Interaction Computations
Described here is the Plastic Domain Decomposition (PDD) Method for parallel elasticplastic finite element computations related to Soil–Foundation–Structure Interaction (SFSI) problems. The PDD provides for efficient parallel elastic-plastic finite element computations steered by an adaptable, runtime repartitioning of the finite element domain. The adaptable repartitioning aims at balancing co...
متن کاملPLUM: Parallel Load Balancing for Adaptive Unstructured Meshes
Mesh adaption is a powerful tool for eecient unstructured-grid computations but causes load imbalance among processors on a parallel machine. We present a novel method called PLUM to dynamically balance the processor workloads with a global view. This paper describes the implementation and integration of all major components within our dynamic load balancing strategy for adaptive grid calculati...
متن کاملExperiments with Repartitioning and Load Balancing Adaptive Meshes
Mesh adaption is a powerful tool for efilcient unstructured-grid computations but causes load imbalance on multiprocessor systems. To address this problem, we have developed PLU M, an automatic portable framework for performing adaptive largescale numerical computations in a message-passing environment. This paper presents several experimental results that verify the effectiveness of PLUM on se...
متن کاملDynamic Load Balancing for Adaptive Scientific Computations via Hypergraph Repartitioning
Adaptive scientific computations require that periodic repartitioning (load balancing) occur dynamically to maintain load balance. Hypergraph partitioning is a successful model for minimizing communication volume in scientific computations, and partitioning software for the static case is widely available. In this paper, we present a new hypergraph model for the dynamic case, where we minimize ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 50 شماره
صفحات -
تاریخ انتشار 1998